Polynomial identities on superalgebras and exponential growth

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Capelli Identities for Lie Superalgebras

The Capelli identity [1] is one of the best exploited results of the classical invariant theory. It provides a set of distinguished generators C1, . . . ,CN for the centre of the enveloping algebra U(glN ) of the general linear Lie algebra. For any non-negative integer M consider the natural action of the Lie algebra glN in the vector space CN⊗CM . Extend it to the action of the algebra U(glN )...

متن کامل

Algebras, Dialgebras, and Polynomial Identities *

This is a survey of some recent developments in the theory of associative and nonassociative dialgebras, with an emphasis on polynomial identities and multilinear operations. We discuss associative, Lie, Jordan, and alternative algebras, and the corresponding dialgebras; the KP algorithm for converting identities for algebras into identities for dialgebras; the BSO algorithm for converting oper...

متن کامل

On Derandomizing Tests for Certain Polynomial Identities

We extract a paradigm for derandomizing tests for polynomial identities from the recent AKS primality testing algorithm. We then discuss its possible application to other tests.

متن کامل

Polynomial identities for partitions

For any partition λ of an integer n , we write λ =< 11, 22, . . . , nn > where mi(λ) is the number of parts equal to i . We denote by r(λ) the number of parts of λ (i.e. r(λ) = ∑n i=1mi(λ) ). Recall that the notation λ ` n means that λ is a partition of n . For 1 ≤ k ≤ N , let ek be the k-th elementary symmetric function in the variables x1, . . . , xN , let hk be the sum of all monomials of to...

متن کامل

Interprocedurally Analyzing Polynomial Identities

Since programming languages are Turing complete, it is impossible to decide for all programs whether a given non-trivial semantic property is valid or not. The way-out chosen by abstract interpretation is to provide approximate methods which may fail to certify a program property on some programs. Precision of the analysis can be measured by providing classes of programs for which the analysis ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2003

ISSN: 0021-8693

DOI: 10.1016/s0021-8693(03)00528-3